package leetcode.code0152;

import leetcode.IDebug;
import leetcode.helper.HelpDebug;

public abstract class Solution152 implements IDebug {

	public abstract int maxProduct(int[] nums);

	@Override
	public void debug1() {
		String str = "[2,3,-2,4]";
		int[] nums = HelpDebug.str2array3(str);
		int e = 6;
		int r = this.maxProduct(nums);
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug2() {
		String str = "[-2,0,-1]";
		int[] nums = HelpDebug.str2array3(str);
		int e = 0;
		int r = this.maxProduct(nums);
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug3() {
		// TODO Auto-generated method stub

	}

	@Override
	public void debug4() {
		// TODO Auto-generated method stub

	}

	public void debug5() {
		String str = "[0,2]";
		int[] nums = HelpDebug.str2array3(str);
		int e = 2;
		int r = this.maxProduct(nums);
		HelpDebug.compare(e, r);
	}

	public void debug6() {
		String str = "[2,-5,-2,-4,3]";
		int[] nums = HelpDebug.str2array3(str);
		int e = 24;
		int r = this.maxProduct(nums);
		HelpDebug.compare(e, r);
	}

}
